Woven convolutional graph codes with large free distances

Woven convolutional graph codes with large free distances

Constructions of woven graph codes based on constituent convolutional codes are studied, and examples of woven convolutional graph codes are presented. Existence of codes satisfying the Costello lower bound on the free distance within a random ensemble of woven graph codes based on s-partite, s-uniform hypergraphs is shown, where s depends only on the code rate. Simulation results for Viterbi d...

On Woven Convolutional Codes

Pipeline Decoding of Woven Convolutional Codes

A pipeline decoder for woven convolutional codes (WCCs) is introduced. The decoding is performed iteratively by shifting a window over the received sequence. For the symbol–by–symbol a posteriori (s/s– APP) decoding of convolutional code segments, a windowed version of the BCJR algorithm is applied. This pipeline concept allows a trade–off between decoding delay, decoding complexity, and perfor...

On Permutor Design for Woven Convolutional Codes with Outer Warp

A permutor design for woven convolutional encoders with outer warp is introduced. All warp permutors are considered jointly, and for the overall design an approach similar to that of higher order separations for serially concatenated convolutional codes is applied. We present a bound on the minimum distance of a code generated by a woven convolutional encoder with outer warp and designed row pe...

Woven Codes with Outer Block Codes

Woven codes with outer binary block codes and additional permutation are presented. This enables the construction of a new class of woven block codes, where the minimum distance is about twice the product of the minimum distances of the component codes.